Handle NLC grammars and R. E. languages

Prospects for e-grammars and endangered languages corpora

Probabilistic Grammars and Languages

A classic theorem of Ellis (1970) asserts that there are probabilistic languages (p-languages) that are not generated by any probabilistic finite state grammar (PFSG) even though their support (the set of strings with nonzero probability) is regular. Ellis’ proof is highly algebraic, and gives no indication why such p-languages exist. Suppes (1970) argued that Ellis’ construction is an artefact...

Free Grammars and Languages

Floyd’s Operator Precedence languages (OPLs) were originally introduced to support deterministic parsing of programming languages [11]; then, interest in them decayed for several decades, probably due to the advent of more expressive grammars, such as LR ones which also allow for efficient deterministic parsing. Recently, however, we renewed our interest in this family of languages on the basis...

The NLC IR and e+e-/e e Compatibility Issues*

This paper collects and summarizes information presented at previous e-eworkshops. Firstly, the various options for reconfiguring magnets and power sources to convert the NLC to eeoperation are discussed. Secondly, the expected backgrounds from pair creation at the interaction point are presented. Lastly, beam loss in the extraction line is discussed. Submitted to the Proceedings of the 4 th In...

Single W R Production in e − e − Collisions at the NLC ∗

Single WR production in e e collisions at the NLC can be used to probe the Majorana nature of the heavy neutrinos present in the Left-Right Symmetric Model below the kinematic threshold for their direct production. For colliders in the √ s = 1 − 1.5 TeV range, typical cross sections of order 1 − 10fb are obtained, depending on the specific choice of model parameters. Backgrounds arising from St...